Branch and Bound for Semi-Supervised Support Vector Machines
نویسندگان
چکیده
Semi-supervised SVMs (SVM) attempt to learn low-density separators by maximizing the margin over labeled and unlabeled examples. The associated optimization problem is non-convex. To examine the full potential of SVMs modulo local minima problems in current implementations, we apply branch and bound techniques for obtaining exact, globally optimal solutions. Empirical evidence suggests that the globally optimal solution can return excellent generalization performance in situations where other implementations fail completely. While our current implementation is only applicable to small datasets, we discuss variants that can potentially lead to practically useful algorithms.
منابع مشابه
Sampled Branch and Bound method for Transductive Support Vector Machines
A Support Vector Machine (SV M) is a powerful classifier method, already used in many problems, which can be viewed as a convex optimization. In recent years, a considerable attention has been given on semi-supervised learning, differing from traditional supervised learning by making use of unlabelled data. In fact, in many applications like text categorization, collecting labelled examples may...
متن کاملMulti-view Laplacian Support Vector Machines
We propose a new approach, multi-view Laplacian support vector machines (SVMs), for semi-supervised learning under the multiview scenario. It integrates manifold regularization and multi-view regularization into the usual formulation of SVMs and is a natural extension of SVMs from supervised learning to multi-view semi-supervised learning. The function optimization problem in a reproducing kern...
متن کاملAn Inexact Implementation of Smoothing Homotopy Method for Semi-Supervised Support Vector Machines
Semi-supervised Support Vector Machines is an appealing method for using unlabeled data in classification. Smoothing homotopy method is one of feasible method for solving semi-supervised support vector machines. In this paper, an inexact implementation of the smoothing homotopy method is considered. The numerical implementation is based on a truncated smoothing technique. By the new technique, ...
متن کاملSemi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic function solution. We motivate the approach, compare it to existing work, and prove a bound on its generalization error. The quality of our solutions is evaluated on a synthetic problem and three UCI ML repository dataset...
متن کاملSemi-Supervised Support Vector Rainfall Estimation Using Satellite Images
In this paper we introduce the use of semi-supervised support vector machines for rainfall estimation using images obtained from visible and infrared NOAA satellite channels. Two experiments were performed, one involving traditional SVM and other using semi-supervised SVM (SVM). The SVM approach outperforms SVM in our experiments, with can be seen as a good methodology for rainfall satellite es...
متن کامل